Fluid and Heavy Traffic Diffusion Limits for a Generalized Processor Sharing Model By
نویسندگان
چکیده
Under fairly general assumptions on the arrival and service time processes, we prove fluid and heavy traffic limit theorems for the unfinished work, queue length, sojourn time and waiting time processes associated with a single station multiclass generalized processor sharing model. The fluid limit of the unfinished work process is characterized by the Skorokhod map associated with a Skorokhod problem formulation of the generalized processor sharing model, while the heavy traffic diffusion limit is characterized using the corresponding extended Skorokhod map. An interesting feature of the diffusion limits is that they may fail to be semimartingales.
منابع مشابه
The Heavy Traffic Limit of an Unbalanced Generalized Processor Sharing Model By
This work considers a server that processes J classes using the generalized processor sharing discipline with base weight vector α = (α1, . . . , αJ ) and redistribution weight vector β = (β1, . . . , βJ ). The invariant manifold M of the so-called fluid limit associated with this model is shown to have the form M = {x ∈R+ :xj = 0 for j ∈ S}, where S is the set of strictly subcritical classes, ...
متن کاملThe Heavy Traffic Limit of an Unbalanced Generalized Processor Sharing Model
This work considers a server that processes J classes using the generalized processor sharing discipline with base weight vector α= (α1, . . . , αJ ) and redistribution weight vector β = (β1, . . . , βJ ). The invariant manifold M of the so-called fluid limit associated with this model is shown to have the form M = {x ∈ RJ+ :xj = 0 for j ∈ S}, where S is the set of strictly subcritical classes,...
متن کاملDiffusion Limits of Limited Processor Sharing Queues
We consider a processor sharing queue where the number of jobs served at any time is limited to K, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this measure-valued process is obtained under diffusion scaling and heavy traffic conditions. As a consequence, the limit of the system size process is proved to be a p...
متن کاملDiffusion Limits of Limited Processor Sharing
We consider a processor sharing queue where the number of jobs served at any time is limited to K, with the excess jobs waiting in a buffer. We use random counting measures on the positive axis to model this system. The limit of this measure-valued process is obtained under diffusion scaling and heavy traffic conditions. As a consequence, the limit of the system size process is proved to be a p...
متن کاملInvariant States and Rates of Convergence for a Critical Fluid Model of a Processor Sharing
This paper contains an asymptotic analysis of a fluid model for a heavily loaded processor sharing queue. Specifically, we consider the behavior of solutions of critical fluid models as time approaches ∞. The main theorems of the paper provide sufficient conditions for a fluid model solution to converge to an invariant state and, under slightly more restrictive assumptions, provide a rate of co...
متن کامل